package leetcode2;

import leetcode.TreeNode;

import java.util.Arrays;

public class PrintNumbers {
    public int[] printNumbers(int n) {
        StringBuilder sb = new StringBuilder();
//        sb.append("9".repeat(Math.max(0, n)));
        int max = Integer.parseInt(sb.toString());
        int[] res = new int[max];
        for (int i = 1; i <= max; i++) {
            res[i - 1] = i;
        }
        return res;
    }

    public static void main(String[] args) {
        PrintNumbers printNumbers = new PrintNumbers();
        System.out.println(Arrays.toString(printNumbers.printNumbers(1)));
    }
}
